package www.waiser.com.lc210225;

/**
 * <p>
 *         秒杀题 没意思 复习一下二维数组
 * </p>
 *
 * @Author mengwei
 * @Date 2021/2/25
 */
public class LeetCode876 {
    public int[][] transpose(int[][] matrix) {
        int[][] res = new int[matrix[0].length][matrix.length];
        for (int i = 0; i < matrix.length; i++) {
            for (int j = 0; j < matrix[i].length; j++) {
                res[j][i] = matrix[i][j];
            }

        }
        return res;

    }
}
